Causality versus true-concurrency

The Mutex Paradigm of Concurrency

Concurrency can be studied at different yet consistent levels of abstraction: from individual behavioural observations, to more abstract concurrent histories which can be represented by causality structures capturing intrinsic, invariant dependencies between executed actions, to system level devices such as Petri nets or process algebra expressions. Histories can then be understood as sets of c...

Optimizing Distributed Read-Only Transactions Using Multiversion Concurrency

Distributed transactional systems typically achieve efficiency by abandoning true serializability for weaker forms of consistency that are difficult to reason about because they expose the concurrency in the underlying system. We explore an alternate route: weakening causality instead of consistency. Our proposed algorithm achieves global serializability by sacrificing global causality, which w...

Causality and True Concurrency: A Data-flow Analysis of the Pi-Calculus (Extended Abstract)

A Domain View of Timed Behaviors

The intention of this paper is to introduce a timed extension of transition systems with independence, and to study its categorical interrelations with other timed ”true-concurrent” models. In particular, we show the existence of a chain of coreflections leading from a category of the model of timed transition systems with independence to a category of a specially defined model of marked Scott ...

From Causal Semantics To Duration Timed Models

The interleaving semantics is not compatible with both action refinement and durational actions. Since many true concurrency semantics are congruent w.r.t. action refinement, notably the causality and the maximality ones [4, 5], this has challenged us to study the dense time behavior where the actions are of arbitrary fixed duration within the causality semantics of Da Costa [4]. We extend the ...